public class Solution {
    public void quickSort(int[] arr, int low, int high){
        if(low < high){
            int i = partition(arr, low, high);
            quickSort(arr, low, i-1);
            quickSort(arr, i+1, high);
        }
    }

    private int partition(int[] arr, int low, int high) {
        int i = low - 1;
        for (int j = low; j < high; j++) {
            if(arr[j] < arr[high]){
                i++;
                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
        int temp = arr[i + 1];
        arr[i + 1] = arr[high];
        arr[high] = temp;

        return i + 1;

    }

}
